Reduced Complexity Symbol Detectors with Parallel Structures
نویسنده
چکیده
The problem of practical realization of the optimal Axed-delay symbol-by-symbol detection algorithm is investigated. A simplified parallel symbol (SPS) detector is derived which is several times faster and simpler than that suggested by the original algorithm. A number of approximations are applied to the SPS detector which lead to the derivation of suboptimal detectors. An interesting suboptimal detector so derived turns out to be identical to the minimum-metric Viterbi detector. A comparison of the SPS and the Viterbi detectors shows that the former has a slightly better performance at low values of SNR and the latter performs a smaller number of computations (particularly) at high values of the delay constraint; otherwise, the two are comparable in performance and complexity.
منابع مشابه
Reduced complexity symbol detectors with parallel structure for ISI channels
Absrracr The problem of practical realization of the optimal fixed-delay symbol-by-symbol detection algorithm, which is optimum in the sense of minimizing the symbol error probability, given a delay constraint D, is investigated. A fully-parallel structure is developed, and through systematic reformulations of the algorithm, the computational requirements are reduced considerably. In addition, ...
متن کاملBER analysis of Bayesian equalization using orthogonal hyperplanes
Bayesian symbol-by-symbol detection using a finite sequence observation space has been the subject of renewed research interest. The Bayesian transverse equalizer (BTE) and Bayesian decision feedback equalizer (BDFE) are two common Bayesian detectors. It is often difficult to evaluate the bit-error rate (BER) performance of these Bayesian detectors since the BER cannot be analytically evaluated...
متن کاملApplications of the PAM Representation of CPM
In this thesis, we are trying to optimize the tradeoff between the receiver complexity and its performance for two modulations currently used in aeronautical telemetry. A reduced complexity detector is of interest because it reduces the implementation cost. The Pulse Amplitude Modulation (PAM) representation of Continuous Phase Modulation (CPM) signals typically results in reducedcomplexity det...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملParallel group detection for synchronous CDMA communication over frequency-selective Rayleigh fading channels
A group detector jointly detects a group of users, and a parallel group detection scheme is a bank of J independently operating group detectors, one for each group of a J group partition of the I< transmitting users of a Code-Division MultipleAccess (CDMA) channel. In this paper, two group detectors are introduced for the Frequency-Selective Rayleigh Fading (FSRF) CDMA channel. While the optimu...
متن کامل